Phase diagram of Symmetric Iterated Prisoner's Dilemma of Two-Companies with Partial Imitation Rule
نویسندگان
چکیده
The problem of two companies of agents with one-step memory playing game is investigated in the context of the Iterated Prisoner's Dilemma under the partial imitation rule, where a player can imitate only those moves that he has observed in his games with his opponent. We limit our study to the special case where the players in the two groups enjoy the same conditions on a fully connected network, so that there are only two payoff matrices required: one for players playing games with members of the same company, and the other one for players playing games with members from a different company. We show that this symmetric case of two companies of players can be reduced to the one-company case with an effective payoff matrix, from which a phase diagram for the players using the two dominant strategies, Pavlov and Grim Trigger can be constructed. The phase diagram is computed by numerical integration of the approximate mean value equations. The results are in good agreement with simulations of the two-company model. The phase diagram leads to an interesting conclusion that a player will more likely become a Grim Trigger, regardless of their affiliated company, when the noise level increases so that he is more irrational, or when the intra-group temptation to defect increases. PACS number(s): 02.50.Le, 87.23.Kg, 87.23.Ge, 87.19.lv 02.50.Le Decision theory and game theory 87.23.Kg Dynamics of evolution 87.23.Ge Dynamics of social systems 87.19.lv Learning and memory
منابع مشابه
Evolution of Grim Trigger in Prisoner Dilemma Game with Partial Imitation
The emergence of Grim Trigger as the dominant strategy in the Iterated Prisoner Dilemma (IPD) on a square lattice is investigated for players with finite memory, using three different kinds of imitation rule: the traditional imitation rule where the entire data base of the opponent’s moves is copied, and the two more realistic partial imitation rules that copy only a subset of opponent’s moves ...
متن کاملPartial Imitation Rule in Iterated Prisoner Dilemma Game on a Square Lattice
[Abstract] A realistic replacement of the general imitation rule in the Iterated Prisoner Dilemma (IPD) is investigated with simulation on square lattice, whereby the player, with finite memory, can only imitate those behaviors of the opponents observed in past games. In contrast to standard practice where all the possible behaviors of the opponents are accessible, the new partial imitation rul...
متن کاملImitation with incomplete information in 2x2 games
Evolutionary game theory has been an important tool for describing economic and social behaviour for decades. Approximate mean value equations describing the time evolution of strategy concentrations can be derived from the players’ microscopic update rules. We show that they can be generalized to a learning process. As an example, we compare a restricted imitation process, in which unused part...
متن کاملThe Evolution of Cellar Automaton based on Dilemmma Games with Selfish Strategy
We have proposed two new evolutionary rules on spatio-iterated games that is not mimic evolution of strategies, and mainly discussed the Prisoner’s Dilemma game [10] by the two evoutionary rules [11]. In this paper we focus the first rule, that is, the selfish evolutionary rule for various dilemma games. In contrast to the Prisoner’s Dilemma, there are gererally rich pase structures in the dile...
متن کاملSmale Strategies For The N-Person Iterated Prisoner's Dilemma
Adapting methods introduced by Steven Smale, we describe good strategies for a symmetric version of the Iterated Prisoner’s Dilemma with n players.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1103.6103 شماره
صفحات -
تاریخ انتشار 2011